On Deriving Nested Calculi for Intuitionistic Logics from Semantic Systems

This paper shows how to derive nested calculi from labelled calculi for propositional intuitionistic logic and first-order intuitionistic logic with constant domains, thus connecting the general results for labelled calculi with the more refined formalism of nested sequents. The extraction of nested calculi from labelled calculi obtains via considerations pertaining to the elimination of structural rules in labelled derivations. Each aspect of the extraction process is motivated and detailed, showing that each nested calculus inherits favorable proof-theoretic properties from its associated labelled calculus

From Display to Labelled Proofs for Tense Logics

We introduce an effective translation from proofs in the display calculus to proofs in the labelled calculus in the context of tense logics. We identify the labelled calculus proofs in the image of this translation as those built from labelled sequents whose underlying directed graph possesses certain properties. For the basic normal tense logic Kt, the image is shown to be the set of all proofs in the labelled calculus G3Kt

Endurant Types in Ontology-Driven Conceptual Modeling: Towards OntoUML 2.0

For over a decade now, a community of researchers has contributed to the development of the Unified Foundational Ontology (UFO) - aimed at providing foundations for all major conceptual modeling constructs. This ontology has led to the development of an Ontology-Driven Conceptual Modeling language dubbed OntoUML, reflecting the ontological micro-theories comprising UFO. Over the years, UFO and OntoUML have been successfully employed in a number of academic, industrial and governmental settings to create conceptual models in a variety of different domains. These experiences have pointed out to opportunities of improvement not only to the language itself but also to its underlying theory. In this paper, we take the first step in that direction by revising the theory of types in UFO in response to empirical evidence. The new version of this theory shows that many of the meta-types present in OntoUML (differentiating Kinds, Roles, Phases, Mixins, etc.) should be considered not as restricted to Substantial types but instead should be applied to model Endurant Types in general, including Relator types, Quality types and Mode types. We also contribute a formal characterization of this fragment of the theory, which is then used to advance a metamodel for OntoUML 2.0. Finally, we propose a computational support tool implementing this updated metamodel

A Tableaux Calculus for Reducing Proof Size

A tableau calculus is proposed, based on a compressed representation of clauses, where literals sharing a similar shape may be merged. The inferences applied on these literals are fused when possible, which reduces the size of the proof. It is shown that the obtained proof procedure is sound, refutationally complete and allows to reduce the size of the tableau by an exponential factor. The approach is compatible with all usual refinements of tableaux.Comment: Technical Repor

Nanometer scale electronic reconstruction at the interface between LaVO3 and LaVO4

Electrons at interfaces, driven to minimize their free energy, are distributed differently than in bulk. This can be dramatic at interfaces involving heterovalent compounds. Here we profile an abrupt interface between V 3d2 LaVO3 and V 3d0 LaVO4 using electron energy loss spectroscopy. Although no bulk phase of LaVOx with a V 3d1 configuration exists, we find a nanometer-wide region of V 3d1 at the LaVO3/LaVO4 interface, rather than a mixture of V 3d0 and V 3d2. The two-dimensional sheet of 3d1 electrons is a prototypical electronic reconstruction at an interface between competing ground states.Comment: 14 pages, 5 figure

Representational task formats and problem solving strategies in kinematics and work

Previous studies have reported that students employed different problem solving approaches when presented with the same task structured with different representations. In this study, we explored and compared students’ strategies as they attempted tasks from two topical areas, kinematics and work. Our participants were 19 engineering students taking a calculus-based physics course. The tasks were presented in linguistic, graphical, and symbolic forms and requested either a qualitative solution or a value. The analysis was both qualitative and quantitative in nature focusing principally on the characteristics of the strategies employed as well as the underlying reasoning for their applications. A comparison was also made for the same student’s approach with the same kind of representation across the two topics. Additionally, the participants’ overall strategies across the different tasks, in each topic, were considered. On the whole, we found that the students prefer manipulating equations irrespective of the representational format of the task. They rarely recognized the applicability of a ‘‘qualitative’’ approach to solve the problem although they were aware of the concepts involved. Even when the students included visual representations in their solutions, they seldom used these representations in conjunction with the mathematical part of the problem. Additionally, the students were not consistent in their approach for interpreting and solving problems with the same kind of representation across the two topical areas. The representational format, level of prior knowledge, and familiarity with a topic appeared to influence their strategies, their written responses, and their ability to recognize qualitative ways to attempt a problem. The nature of the solution does not seem to impact the strategies employed to handle the problem

Verifying Temporal Heap Properties Specified via Evolution Logic

This paper addresses the problem of establishing temporal properties of programs written in languages, such as Java, that make extensive use of the heap to allocate--- and deallocate---new objects and threads. Establishing liveness properties is a particularly hard challenge. One of the crucial obstacles is that heap locations have no static names and the number of heap locations is unbounded. The paper presents a framework for the verification of Java-like programs. Unlike classical model checking, which uses propositional temporal logic, we use first-order temporal logic to specify temporal properties of heap evolutions; this logic allows domain changes to be expressed, which permits allocation and deallocation to be modelled naturally. The paper also presents an abstract-interpretation algorithm that automatically verifies temporal properties expressed using the logic

Regulation by anti-inflammatory cytokines (IL-4, IL-10, IL-13, TGFβ)of interleukin-8 production by LPS- and/ or TNFα-activated human polymorphonuclear cells

The capacity to down-regulate the production of IL-8 by LPS-activated human polymorphonuclear cells (PMN) has been demonstrated for IL-4, IL-10, and TGFβ. We compared their relative capacities and further extended this property to IL-13. We report a great heterogeneity among individuals related to the responsiveness of PMN to the IL-4 and IL-13 inhibitory effects while their response to the IL-10 effect was homogenous. The inhibitory activities were observed at the transcriptional level. IL-8 induction by TNFα was, unlike its induction by LPS, resistant to the inhibitory effects of IL-10, IL-4, IL-13 and TGFβ. Furthermore, IL-10 and IL-4 inhibitory activity were less effective when TNFα was acting synergistically with LPS to induce IL-8 production by PMN. LPS-induced cell-associated IL-8, detected in the PMN cultures, could be marginally inhibited by IL-4 and IL-10. Altogether, our data demonstrate that IL-13 is able to inhibit LPS-induced IL-8 production by human PMN, although IL-10 remains the most active anti-inflammatory cytokine. Despite the capacity of IL-4, IL-10, and IL-13 to limit the production of TNFα-induced IL-8 in a whole blood assay, none was able to inhibit this production when studying isolated human polymorphonuclear cells